Continuous-Time Consensus under Persistent Connectivity and Slow Divergence of Reciprocal Interaction Weights
نویسندگان
چکیده
منابع مشابه
Continuous-Time Consensus under Persistent Connectivity and Slow Divergence of Reciprocal Interaction Weights
In this paper, we develop new results on consensus for continuous-time multi-agent systems. We introduce the assumptions of persistent connectivity of the interaction graph and of slow divergence of reciprocal interaction weights. Persistent connectivity can be considered as the counterpart of the notion of ultimate connectivity used in discrete-time consensus protocols. Slow divergence of reci...
متن کاملexistence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types
بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی بیان شده اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...
15 صفحه اولContinuous-time consensus with discrete-time communications
This paper addresses the problem of reaching consensus among a group of agents that evolve in continuous-time and exchange information at discretetime instants, referred to as update times. Each agent has its own sequence of update times and therefore the agents are not required to keep synchronized clocks among them. At each update time, an agent receives from a subset of the other agents thei...
متن کاملStochastic stability of continuous time consensus protocols
A unified approach to studying convergence and stochastic stability of continuous time consensus protocols (CPs) is presented in this work. Our method applies to networks with directed information flow, both cooperative and noncooperative interactions, networks under weak stochastic forcing, and those whose topology and strength of connections may vary in time. The graph theoretic interpretatio...
متن کاملSlow transport by continuous time quantum walks.
Continuous time quantum walks (CTQWs) do not necessarily perform better than their classical counterparts, the continuous time random walks (CTRWs). For one special graph, where a recent analysis showed that in a particular direction of propagation the penetration of the graph is faster by CTQWs than by CTRWs, we demonstrate that in another direction of propagation the opposite is true. In this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 2013
ISSN: 0363-0129,1095-7138
DOI: 10.1137/11083438x